Expanding Window Fountain Codes for Unequal Error ProtectionSEJDINOVIC, Dino; VUKOBRATOVIC, Dejan; DOUFEXI, Angela et al.IEEE transactions on communications. 2009, Vol 57, Num 9, pp 2510-2516, issn 0090-6778, 7 p.Article

On-the-Fly Maximum-Likelihood Decoding of Raptor Codes over the Binary Erasure ChannelKIM, Saejoon; LEE, Seunghyuk; HEO, Jun et al.IEICE transactions on communications. 2011, Vol 94, Num 4, pp 1062-1065, issn 0916-8516, 4 p.Article

On (n, n — 1) Punctured Convolutional Codes and Their Trellis ModulesKATSIOTIS, Alexandros; KALOUPTSIDIS, Nicholas.IEEE transactions on communications. 2011, Vol 59, Num 5, pp 1213-1217, issn 0090-6778, 5 p.Article

Maximum likelihood decoding of RLL-FEC array codes on partial response channelsMARKARIAN, G. S; NADERI, M; HONARY, B et al.Electronics Letters. 1993, Vol 29, Num 16, pp 1406-1408, issn 0013-5194Article

Superimposed codes based on punctured convolutional codesHATTORI, M; SAITOH, Y.Electronics Letters. 1994, Vol 30, Num 13, pp 1041-1042, issn 0013-5194Article

Towards Maximum Likelihood Soft Decision Decoding of the (255,239) Reed Solomon CodeWENYI JIN; FOSSORIER, Marc.IEEE transactions on magnetics. 2008, Vol 44, Num 3, pp 423-428, issn 0018-9464, 6 p.Article

Simple maximum-likelihood decoding of generalized first-order reed-muller codesSCHMIDT, Kai-Uwe; FINGER, Adolf.IEEE communications letters. 2005, Vol 9, Num 10, pp 912-914, issn 1089-7798, 3 p.Article

Constructing and Decoding GWBE Codes Using Kronecker ProductsPAD, Pedram; MOHAMMAD JAVAD FARAJI; MARVASTI, Farokh et al.IEEE communications letters. 2010, Vol 14, Num 1, pp 1-3, issn 1089-7798, 3 p.Article

Frog-in-the-box index codes with maximum likelihood decoding for robust scalar quantizationNA, Ilju; NEUHOFF, David L.IEEE International Symposium on Information Theory. 2004, isbn 0-7803-8280-3, 1Vol, p. 428Conference Paper

Linear codes with complementary dualsMASSEY, J. L.Discrete mathematics. 1992, Vol 106-7, pp 337-342, issn 0012-365XArticle

Maximum likelihood decoding of trellis codes in fading channels with no receiver CSI is a polynomial-complexity problemHSU, Chun-Hao; ANASTASOPOULOS, Achilleas.IEEE International Symposium on Information Theory. 2004, isbn 0-7803-8280-3, 1Vol, p. 147Conference Paper

Decoding spherical codes for the Gaussian channelKARLOF, J. K.IEEE transactions on information theory. 1993, Vol 39, Num 1, pp 60-65, issn 0018-9448Article

Tomoscintigraphie par ouverture codée Reconstruction par le maximum de vraisemblance = Coded aperture tomography Maximum likelihood reconstructionBerrim, Selma; Moretti, Jean Luc.1998, 211 p.Thesis

Suboptimum decoding of decomposable block codesTAKATA, Y; YAMASHITA, Y; FUJIWARA, T et al.IEEE transactions on information theory. 1994, Vol 40, Num 5, pp 1392-1405, issn 0018-9448Article

Maximum-likelihood trellis decoding technique for balanced codesMARKARIAN, G; HONARY, B; BLAUM, M et al.Electronics Letters. 1995, Vol 31, Num 6, pp 447-448, issn 0013-5194Article

User-separating demodulation for code-division multiple-access systemsRUPF, M; TARKÖY, F; MASSEY, J. L et al.IEEE journal on selected areas in communications. 1994, Vol 12, Num 5, pp 786-795, issn 0733-8716Article

New detection algorithm with reduced complexityBENELLI, G; FANTACCI, R.IEE Proceedings. I. Communications, speech and vision. 1990, Vol 137, Num 1, pp 47-59, 13 p., 1Article

On the ML Decoding of Quasi-Orthogonal Space-Time Block Codes via Sphere Decoding and Exhaustive SearchLEUSCHNER, Jeff; YOUSEFI, Shahram.IEEE transactions on wireless communications. 2008, Vol 7, Num 11, pp 4088-4093, issn 1536-1276, 6 p., 1Article

Analysis of LT Codes over Finite Fields under Optimal Erasure DecodingSCHOTSCH, Birgit; GARRAMMONE, Giuliano; VARY, Peter et al.IEEE communications letters. 2013, Vol 17, Num 9, pp 1826-1829, issn 1089-7798, 4 p.Article

Flexible Convolutional Codes: Variable Rate and ComplexityKATSIOTIS, Alexandros; RIZOMILIOTIS, Panagiotis; KALOUPTSIDIS, Nicholas et al.IEEE transactions on communications. 2012, Vol 60, Num 3, pp 608-613, issn 0090-6778, 6 p.Article

A New Sub-Optimal Decoder for Quasi-Orthogonal Space-Time Block CodesLEUSCHNER, Jeff; YOUSEFI, Shahram.IEEE communications letters. 2008, Vol 12, Num 8, pp 548-550, issn 1089-7798, 3 p.Article

Reliability-based decoding of Reed-Solomon codes using their binary imageFOSSORIER, Marc; VALEMBOIS, Antoine.IEEE communications letters. 2004, Vol 8, Num 7, pp 452-454, issn 1089-7798, 3 p.Article

A Near-ML Decoding with Improved Complexity over Wider Ranges of SNR and System Dimension in MIMO SystemsAHN, Junil; LEE, Heung-No; KIM, Kiseon et al.IEEE transactions on wireless communications. 2012, Vol 11, Num 1, pp 33-37, issn 1536-1276, 5 p.Article

Low complexity MIMO detection based on the slowest descent methodSIMOENS, Frederik; VAN WELDEN, Dieter; WYMEERSCH, Henk et al.IEEE communications letters. 2007, Vol 11, Num 5, pp 429-431, issn 1089-7798, 3 p.Article

Comment on: Efficient- maximum-likelihood decoding of Q-ary modulated reed-muller codesSCHMIDT, Kai-Uwe.IEEE communications letters. 2006, Vol 10, Num 1, issn 1089-7798, p. 52Article